package tree;

import offer.TreeNode;

public class leetCode104_maxDepth {

    public int maxDepth(TreeNode root) {
       if(root == null) return 0;

       int left = maxDepth(root.left);
       int right = maxDepth(root.right);
       return Math.max(right,left) + 1;


    }

}
